Partial subadditivity of entropies
نویسندگان
چکیده
In this paper a kind of partial subadditivity of the entropy is investigated in probability theory and in matrix theory. We show some new inequalities related to the subadditivity of the standard entropy and its one-parameter generalization in the discrete case. The matrix analogues of the inequalities are also studied. The standard entropy is related to the function −x log x, but here some other functions are also used. A new version of the subadditivity of the Tsallis entropy is included in the probabilistic case and a conjecture in the matrix case.
منابع مشابه
Fundamental properties on Tsallis entropies
A chain rule and a subadditivity for the entropy of type β, which is one of the nonextensive (nonadditive) entropies, were derived by Z.Daróczy. In this paper, we study the further relations among Tsallis type entropies which are typical nonextensive entropies. We show some inequalities related to Tsallis entropies, especially the strong subadditivity for Tsallis type entropies and the subaddit...
متن کاملCharacterisations of Matrix and Operator-Valued $Φ$-Entropies, and Operator Efron-Stein Inequalities
We derive new characterizations of the matrix Φ-entropy functionals introduced in Chen & Tropp (Chen, Tropp 2014 Electron. J. Prob.19, 1-30. (doi:10.1214/ejp.v19-2964)). These characterizations help us to better understand the properties of matrix Φ-entropies, and are a powerful tool for establishing matrix concentration inequalities for random matrices. Then, we propose an operator-valued gene...
متن کاملChain rules and subadditivity for Tsallis entropies
Chain rules for Tsallis type entropies are proven, as including the famous pseudoadditivity in nonextensive statistics as a special case. They give important relations between Tsallis conditional entropy and Tsallis joint entropy. Moreover the subadditivity of Tsallis type entropies is shown for the correlated two random variables in the case of q ≥ 1 with the help of the generalized Shannon in...
متن کاملA holographic proof of the strong subadditivity of entanglement entropy
When a quantum system is divided into subsystems, their entanglement entropies are subject to an inequality known as strong subadditivity. For a field theory this inequality can be stated as follows: given any two regions of space A and B, S(A)+S(B) ≥ S(A∪B)+ S(A ∩ B). Recently, a method has been found for computing entanglement entropies in any field theory for which there is a holographically...
متن کاملA new inequality for the von Neumann entropy
Strong subadditivity of von Neumann entropy, proved in 1973 by Lieb and Ruskai, is a cornerstone of quantum coding theory. All other known inequalities for entropies of quantum systems may be derived from it. Here we prove a new inequality for the von Neumann entropy which we prove is independent of strong subadditivity: it is an inequality which is true for any four party quantum state, provid...
متن کامل